Three results on frequency assignment in linear cellular networks
نویسندگان
چکیده
منابع مشابه
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request has two more attributes: its arrival and departure times, and it is considered active from the time of arrival to the time of departure. We want to assign frequencies to all requests so that at each time step any two ac...
متن کاملOn frequency assignment in cellular networks
In this paper we consider the problem of frequency assignment in cellular networks. The model we consider is general. We present an algorithm for frequency assignment and analyze its performance.
متن کاملFrequency assignment in cellular phone networks
We present a graph-theoretic model for the frequency assignment problem in Cellular Phone Networks: Obeying several technical and legal restrictions, frequencies have to be assigned to transceivers so that interference is as small as possible. This optimization problem is NP-hard. Good approximation cannot be guaranteed, unless P = NP . We describe several assignment heuristics. These heuristic...
متن کاملDistributed Online Frequency Assignment in Cellular Networks
In this paper, we develop a general framework for studying distributed online frequency assignmentin cellular networks. The problem can be abstracted as a multicoloring problem on a node-weighted graph whose weights change over time. The graph, with nodes corresponding to network cells, is usually modeled as a subgraph of the triangular lattice and the instantaneous weight at a node models the ...
متن کاملA frequency assignment problem in cellular phone networks
We present a mathematical formulation of a frequency assignment problem encountered in cellular phone networks: frequencies have to be assigned to stationary transceivers (carriers) such that as little interference as possible is induced while obeying several technical and legal restrictions. The optimization problem isNP-hard, and no good approximation can be guaranteed, unless P =NP. We sketc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.09.019